A Research on Ensembles Method for One Class Classification Using Convex Hull Polytope Model
نویسنده
چکیده
Classification is a data mining task that allocated similar data to categories or classes. One of the most general methods for classification is ensemble method which refers supervised learning. After generating classification rules we can apply those rules on unidentified data and achieve the results. In oneclass classification it is supposed that only information of one of the classes, the target class, is available. In an ensemble classification system, different base classifiers are combined in order to obtain a classifier with higher performance. In this work, a new one-class classification ensemble strategy called Approximate Polytope Ensemble is presented. The geometrical theory of convex hull is used to define the boundary of the target class defining the problem. Keywords— Bagging, Boosting, Classification, Ensembles, One Class Classification, convex hull, polytope
منابع مشابه
Approximate polytope ensemble for one-class classification
In this work, a new one-class classification ensemble strategy called approximate polytope ensemble is presented. The main contribution of the paper is threefold. First, the geometrical concept of convex hull is used to define the boundary of the target class defining the problem. Expansions and contractions of this geometrical structure are introduced in order to avoid over-fitting. Second, th...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملA High-Performance Model based on Ensembles for Twitter Sentiment Classification
Background and Objectives: Twitter Sentiment Classification is one of the most popular fields in information retrieval and text mining. Millions of people of the world intensity use social networks like Twitter. It supports users to publish tweets to tell what they are thinking about topics. There are numerous web sites built on the Internet presenting Twitter. The user can enter a sentiment ta...
متن کاملRandom polytopes
We prove the central limit theorem for the volume and the f -vector of the random polytope Pn and the Poisson random polytope Πn in a fixed convex polytope P ⊂ IR. Here Pn is the convex hull of n random points in P , and Πn is the convex hull of the intersection of a Poisson process X(n), of intensity n, with P . A general lower bound on the variance is also proved. ∗Supported by Hungarian Nati...
متن کاملCones of Matrices and Set-Functions and 0-1 Optimization
It has been recognized recently that to represent a polyhedron as the projection of a higher dimensional, but simpler, polyhedron, is a powerful tool in polyhedral combinatorics. We develop a general method to construct higher-dimensional polyhedra (or, in some cases, convex sets) whose projection approximates the convex hull of 0-1 valued solutions of a system of linear inequalities. An import...
متن کامل